Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem
نویسندگان
چکیده
منابع مشابه
The Stochastic Container Relocation Problem
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. However, the assumption of knowing the full retrieval order of containers is particularly unrealistic in real operations. This paper studies the stochastic CRP (SCRP), which rel...
متن کاملColumn Generation for the Container Relocation Problem
Container terminals offer transfer facilities to move containers from vessels to trucks, trains and barges and vice versa. Within the terminal the container yard serves as a temporary buffer where incoming containers are piled up in stacks. Only the topmost container of each stack can be accessed. If another container has to be retrieved, containers stored above it must be relocated first. Cont...
متن کاملA tree search procedure for the container relocation problem
In the container relocation problem (CRP) n items are given that belong to G different item groups (g = 1,...,G). The items are piled up in up to S stacks with a maximum stack height H. A move can either shift one item from the top of a stack to the top of another one (relocation) or pick an item from the top of a stack and entirely remove it (remove). A move of the latter type is only feasible...
متن کاملHeuristic Methods for the Unrestricted Dynamic Container Relocation Problem
In this work, we address the unrestricted Dynamic Container Relocation Problem (DCRP). The DCRP is an extension of the Container Relocation Problem (CRP) that is NPhard. The CRP aims to empty a single yard-bay, which contains containers with a given retrieval sequence from the yardbay, such that the total number of relocations is minimized. The DCRP extends the CRP so that containers both arriv...
متن کاملContainer Relocation Problem: Approximation, Asymptotic, and Incomplete Information
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers respecting a given order of retrieval. While the problem is known to be NP-hard, there is much evidence that certain algorithms (such as the A* search [15]) and heuristics perform reasonably well on many instances of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.11.067